An O∗(2.619k) algorithm for 4-Path Vertex Cover
نویسندگان
چکیده
منابع مشابه
Minimum k-path vertex cover
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψk(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of ψk(G) and pr...
متن کاملAn Improved Fixed-Parameter Algorithm for Vertex Cover
The VERTEX COVER problem asks, for input consisting of a graph G on n vertices, and a positive integer k, whether there is a set of k vertices such that every edge of G is incident with at least one of these vertices. We give an algorithm for this problem that runs in time O(kn + (1.324718)'k'). In particular, this gives an 0((1.324718) " n2) algorithm to find the minimum vertex cover in the gr...
متن کاملAn Improved Approximation Algorithm for Vertex Cover with Hard Capacities
In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph G = (V,E), the goal is to cover all the edges by picking a minimum cover using the vertices. When we pick a vertex, we can cover up to a pre-specified number of edges incident on this vertex (its capacity). The problem is clearly NP-hard as it generalizes the well-...
متن کاملNuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem of great importance in both theory and application. Local search has proved successful for this problem. However, there are two main drawbacks in state-of-the-art MVC local search algorithms. First, they select a pair of vertices to exchange simultaneously, which is timeconsuming. Secondly, although...
متن کاملAn Effective Algorithm for Minimum Weighted Vertex Cover Problem
The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Sup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: 0166-218X
DOI: 10.1016/j.dam.2020.11.019